Sequential Constraint Estimation: Implementation Modifications
نویسندگان
چکیده
In recent works, the first author has developed a constraint estimation technique that can be applied to the kinematic tracking problem. This a posteriori technique maintains an unconstrained estimate based solely on the measurements while the constrained estimate is computed, if necessary, at each time step. This technique has been expanded to incorporate nonlinear systems and time-varying systems. In this paper, we modify the original approach to accommodate several implementation issues that have arisen in the discussions about this work. The first modification of this approach is to utilize a probability-based estimator, the extended Kalman filter, as the unconstrained estimator as opposed to the deterministic unconstrained estimator in this work. By showing a minimal variation in performance of the algorithm, the constrained estimator can be shown to be a simple addition to standard tracking estimation routines.
منابع مشابه
Estimation of Software Reliability by Sequential Testing with Simulated Annealing of Mean Field Approximation
Various problems of combinatorial optimization and permutation can be solved with neural network optimization. The problem of estimating the software reliability can be solved with the optimization of failed components to its minimum value. Various solutions of the problem of estimating the software reliability have been given. These solutions are exact and heuristic, but all the exact approach...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملIncorporating Clause Learning in Grid-Based Randomized SAT Solving
Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating clause learning, known to yield significant speed-ups in the sequential case, in such a distributed framework. The approach exploits existing state-of-the-art clause learning SAT solvers by embedding them with virtually no modifications. Th...
متن کاملSEQUENTIAL PENALTY HANDLING TECHNIQUES FOR SIZING DESIGN OF PIN-JOINTED STRUCTURES BY OBSERVER-TEACHER-LEARNER-BASED OPTIMIZATION
Despite comprehensive literature works on developing fitness-based optimization algorithms, their performance is yet challenged by constraint handling in various engineering tasks. The present study, concerns the widely-used external penalty technique for sizing design of pin-jointed structures. Observer-teacher-learner-based optimization is employed here since previously addressed by a number ...
متن کاملProbabilistic and Sequential Computation of Optical Flow Using Temporal Coherence * ( revised version of LIDS - P - 2122 )
In the computation of dense optical flow fields, spatial coherence constraints are commonly used to regularize otherwise ill-posed problem formulations, providing spatial integration of data. In this paper we present a temporal, multi-frame extension of the dense optical flow estimation formulation proposed by Horn and Schunck [1] in which we use a temporal coherence constraint to yield the opt...
متن کامل